The preferential attachment model∗

نویسندگان

  • Winfried Just
  • Hannah Callender
  • M. Drew LaMar
  • Ying Xin
چکیده

Many empirically studied networks have approximately so-called power-law or scale-free degree distributions. In Section 1 we formally define such distributions and explore some of their properties. We also introduce and briefly compare two methods for constructing random networks with approximately power-law degree distributions: generic scale-free networks and the preferential attachment model. In Sections 2 and 3 we explore disease transmission on networks that are obtained from the preferential attachment model and implications for designing effective vaccination strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Preferential Attachment Hypergraphs

The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random hypergraph model to a random preferential attachment ...

متن کامل

Emergence of Global Preferential Attachment From Local Interaction

Global degree/strength based preferential attachment is widely used as an evolution mechanism of networks. But it is hard to believe that any individual can get global information and shape the network architecture based on it. In this paper, it is found that the global preferential attachment emerges from the local interaction models, including distance-dependent preferential attachment (DDPA)...

متن کامل

The power of choice combined with preferential attachment ∗

We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible neighbors are sampled from the existing vertices with probability proportional to degree. Of these possibilities, the new vertex attaches to the vertex from the...

متن کامل

Topological phase transition in a network model with preferential attachment and node removal

Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we identify a topological phase transition depending on the rate of node removal and the relative strength of preferential vs. random attachment, where the degree d...

متن کامل

Link Prediction in Complex Networks by Multi Degree Preferential-Attachment Indices

In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of preferential attachment indices which are different from the previous one. Traditionally, the preferential attachment index is defined by the product of the rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015